/*
 * Copyright (c) 2020, 2022, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */
package org.graalvm.visualizer.search;

import jdk.graal.compiler.graphio.parsing.model.GraphContainer;
import jdk.graal.compiler.graphio.parsing.model.InputGraph;

import java.util.Set;

/**
 * @author sdedic
 */
public interface SearchController {
    public GraphContainer getGraphContainer();

    public InputGraph getInitialGraph();

    public NodesProvider getNodesProvider();

    public String getTitle();

    public Set<InputGraph> getSearchedGraphs();

    public void addSearchListener(SearchListener l);

    public void removeSearchListener(SearchListener l);

    public SearchResultsModel getResults();

    public boolean canSearch(boolean previous);

    public SearchTask extendSearch(boolean previous, boolean stop);

    public SearchTask pendingSearch();

    public Criteria getCriteria();

    public SearchTask newSearch(Criteria crit, boolean replace);
}
